New upper bounds for the spectral variation of a general matrix

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New upper bounds on the spectral radius of unicyclic graphs

Let G = (V (G), E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the unique cycle of G. The graph G− E(Cr ) is a forest of r rooted trees T1,T2, . . .,Tr with root vertices v1, v2, . . ., vr , respectively. Let k(G) = max 1 i r {max{dist(vi , u) : u ∈ V (Ti )}} + 1, where dist(v, u) is the distance from v to u. Let μ1(G) and λ1(G) be the spectral radius of the...

متن کامل

Some new bounds on the general sum--connectivity index

Let $G=(V,E)$ be a simple connectedgraph with $n$ vertices, $m$ edges and sequence of vertex degrees$d_1 ge d_2 ge cdots ge d_n>0$, $d_i=d(v_i)$, where $v_iin V$. With $isim j$ we denote adjacency ofvertices $v_i$ and $v_j$. The generalsum--connectivity index of graph is defined as $chi_{alpha}(G)=sum_{isim j}(d_i+d_j)^{alpha}$, where $alpha$ is an arbitrary real<b...

متن کامل

Some spectral bounds for the harmonic matrix

The aim of this note is to establish new spectral bounds for the harmonic matrix. The Harary matrix of given a connected graph G of order n, say RD(G), is an n-by-n symmetric matrix, such that (RD(G))ij =  1 dij , if i < j, 0 , if i = j, where dij denotes the distance between the vertices i and j [10, 11]. This matrix (originally known as reciprocal distance matrix [11]) is particulary well-k...

متن کامل

Upper bounds for the index of cyclicity of a matrix∗

We derive upper bounds for the index of cyclicity of a matrix as a function of the size of the matrix. This result can be used in the characterization of the ultimate behavior of the sequence of consecutive powers of a matrix in the max-plus algebra, which has maximum and addition as its basic operations. If the matrix is irreducible then it is well known that the ultimate behavior is cyclic. F...

متن کامل

Bounds for the Spectral Radius of a Matrix

Let A = [an] be an n X n matrix with complex entries. We define p(A ) to be the spectral radius of A and | A | to be the matrix [| a,y |]. A. Brauer [1], W. Ledermann [2] and A. Ostrowski [4] have developed bounds for p(\ A |). Their results, coupled with the result of Perron and Frobenius [6] that p(A) ^ p(\ A |) give upper bounds for p( A ) which are not less than p(\ A | ). These bounds are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear and Multilinear Algebra

سال: 2020

ISSN: 0308-1087,1563-5139

DOI: 10.1080/03081087.2020.1822274